Real Addition and the Polynomial Hierarchy
نویسنده
چکیده
** The k-th alternation level of the theory of real numbers under addition and order is log-complete for the k-th level of the polynomial hierarchy. *Submitted to Information Processing Letters **Research supported in part by US Air Force Grant AFOSR 80-0196 ***
منابع مشابه
Polynomial-time hierarchy of computable reals
In mathematics, various representations of real numbers have been investigated and all these representations are proved to be mathematically equivalent. Furthermore, it is known that all effective versions of these representations lead to the same class of “computable real numbers”. However, when subrecursive (such as primitive recursive) is taken into account, these representations can lead to...
متن کاملNew Complexity Thresholds for Sparse Real Polynomials and A-discriminants
Let FEASR denote the problem of deciding whether a given system of real polynomial equations has a real root or not. While FEASR is arguably the most fundamental problem of real algebraic geometry, our current knowledge of its computational complexity is surprisingly coarse. This is a pity, for in addition to numerous practical applications [BGV03], FEASR is also an important motivation behind ...
متن کاملA pr 2 00 9 POLYNOMIAL HIERARCHY , BETTI NUMBERS AND A REAL ANALOGUE OF TODA ’ S THEOREM
Toda [35] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P, namely the class of languages that can be decided by a Turing machine in polynomial time given access to an oracle with the power to compute a function in the counting complexity class #P. This result which illustrates the power of counting is considered to be a seminal result in computation...
متن کاملA Complex Analogue of Toda’s Theorem
Toda [28] proved in 1989 that the (discrete) polynomial time hierarchy, PH, is contained in the class P#P, namely the class of languages that can be decided by a Turing machine in polynomial time given access to an oracle with the power to compute a function in the counting complexity class #P. This result, which illustrates the power of counting is considered to be a seminal result in computat...
متن کاملLower Bounds for Kernelizations
Among others, we show that every parameterized problem with a “linear OR” and with NP-hard underlying classical problem does not have a polynomial reduction to itself that assigns to every instance x with parameter k an instance y with |y| = k · |x|1−ε unless the polynomial hierarchy collapses to its third level (here ε is any given real number greater than zero).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 20 شماره
صفحات -
تاریخ انتشار 1985